DPSA: Deterministic Parallel Search Algorithm in Large Database
نویسندگان
چکیده
منابع مشابه
Parallel Algorithm for Mining Outliers in Large Database
Data mining is a new but important database application. Outlier detection is a kind of data mining, which until now doesn’t have any method of low cost. Knorr suggested Nested-Loop (NL) algorithm, whose time complexity is quadratic to the size of dataset. With detailed explanation and analysis, a modified version (MNL) and a parallel version (PNL) are described here. The cost is reduced to hal...
متن کاملParallel Large Neighborhood Search
Industrial optimization applications must be robust: they must provide good solutions to problem instances of different size and numerical characteristics, and must continue to work well when side constraints are added. A good testbed for constructing such a robust solver is a set of network design problem instances recently made public by France Telecom. Together, these instances comprise the ...
متن کاملFast deterministic sorting on large parallel machines
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random data. Unfortunately many real-world applications require sorting on data that is not uniformly distributed. In this paper, we consider distributions of varying entropies. We describe A-Ranksort, a new sorting algorithm for parallel machines, whose behavior on input di...
متن کاملDeterministic Application of Grover's Quantum Search Algorithm
Grover’s quantum search algorithm finds one of t solutions in N candidates by using (π/4) √ N/t basic steps. It is, however, necessary to know the number t of solutions in advance for using the Grover’s algorithm directly. On the other hand, Boyer etal proposed a randomized application of Grover’s algorithm, which runs, on average, in O( √ N/t) basic steps (more precisely, (9/4) √ N/t steps) wi...
متن کاملUsing a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models
The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2017
ISSN: 1549-3636
DOI: 10.3844/jcssp.2017.452.459